Sequential Single-Cluster Auctions for Robot Task Allocation
نویسندگان
چکیده
Multi-robot task allocation research has focused on sequential single-item auctions and various extensions as quick methods for allocating tasks to robots with small overall team costs. In this paper we outline the benefits of grouping tasks with positive synergies together and auctioning clusters of tasks rather than individual tasks. We show that with task-clustering the winner determination costs remain the same as sequential single-item auctions and that auctioning task-clusters can result in overall smaller team costs.
منابع مشابه
Analysis of Cluster Formation Techniques for Multi-robot Task Allocation Using Sequential Single-Cluster Auctions
Recent research has shown the benefits of using K -means clustering in task allocation to robots. However, there is little evaluation of other clustering techniques. In this paper we compare K -means clustering to single-linkage clustering and consider the effects of straight line and true path distance metrics in cluster formation. Our empirical results show single-linkage clustering with a tr...
متن کاملRepeated Sequential Single-Cluster Auctions with Dynamic Tasks for Multi-Robot Task Allocation with Pickup and Delivery
In this paper we study an extension of the multi-robot task allocation problem for online tasks requiring pickup and delivery. We extend our previous work on sequential single-cluster auctions to handle this more complex task allocation problem. Our empirical experiments analyse this technique in the domain of an environment with dynamic task insertion. We consider the trade-off between solutio...
متن کاملSequential Single-Cluster Auctions for Multi-Robot Task Allocation
This thesis studies task allocation in multi-robot teams operating in dynamic environments. The multi-robot task allocation problem is a complex NP-Complete optimisation problem with globally optimal solutions often difficult to find. Because of this, the rapid generation of near optimal solutions to the problem that minimise task execution time and/or energy used by robots is highly desired. O...
متن کاملRepeated Sequential Auctions with Dynamic Task Clusters
Sequential auctions can be used to provide solutions to the multi-robot task-allocation problem. In this paper we extend previous work on sequential auctions and propose an algorithm that clusters and auctions uninitiated task clusters repeatedly upon the completion of individual tasks. We demonstrate empirically that our algorithm results in lower overall team costs than other sequential aucti...
متن کاملSequential Single-Cluster Auctions
My thesis is concerned with task allocation in multi-robot teams operating in dynamic environments. The key contribution of this work is the development of a distributed multi-robot task allocation auction that allocates clusters of tasks to robots over multiple bidding rounds. Empirical evaluation has shown this auction routine performs well in handling online task insertion and task reallocat...
متن کامل